Fast Image Replacement through Texture Synthesis
نویسندگان
چکیده
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing training using this image data. The properties of principal component analysis (PCA) are used to reduce the dimensions of the data representation and to recombine the appearance of the features. Additionally, the vector quantization (VQ) algorithm is employed to reduce the time spent on comparison. For the synthesis module, the training data is used to rapidly synthesize a large output texture, or is employed to rapidly replace the removed regions of an image. The multi-resolution approach is applied to speed up the procedure of our algorithm: the down-sampling step is the training process and the up-sampling step is in the order of reconstructing (or synthesizing) the replaced region. That is, our system can rapidly obtain a high image quality and a promising result.
منابع مشابه
Image replacement through texture synthesis
Photographs and images often have regions which are in some sense flawed. Often, there may be a stain or an undesired feature covering a significant portion of the image, and an algorithm that can “fix” the image is desired. We propose a technique based on Heeger and Bergen’s texture synthesis algorithm [4]. By integrating a composition step into the aforementioned algorithm, one portion of the...
متن کاملFast Image Replacement Using Multi-resolution Approach
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing the training process by using this image data. According to the training non-periodic or periodic pattern, we use different sampling methods to have different amount of patches in order to reduce the emergences of th...
متن کاملTexture Synthesis using TSVQ and Target Re-synthesis
This paper presents a simple texture synthesis method that is fast, efficient, and optimized. Given an input texture, the algorithm will synthesize a texture image of specified size by matching output image pixel neighborhoods with input pixel neighborhoods. The pixel-neighborhood matching will be aided by the use of a TreeStructured Vector Quantization (TSVQ) method which will allow the algori...
متن کاملUser Constrained Multiscale MRF Model for Texture Mixture Synthesis and its Application to Texture Replacement
The original multiscale MRF texture model proposed by Paget (IEEE Transactions on Image Processing, 1998, page 925-931) can be used to synthesize a broad range of textures but is limited to taking a single input texture and outputting a homogeneous texture similar to the input. This is insufficient for textures that have combined visual characteristics from several different sources. To address...
متن کاملFast Scale Invariant Texture Synthesis with Gpu Acceleration
This paper presents a new algorithm for synthesising image texture. Texture synthesis is an important process in image post-production. Previous approaches can be classified as either parametric or nonparametric. Of these nonparametric approaches have achieved the most impressive results. Unfortunately, these methods generally suffer from high computational cost and difficulty in handling scale...
متن کامل